Optimal Ramsey Tax Cycles
نویسندگان
چکیده
منابع مشابه
Planar Ramsey numbers for cycles
For two given graphs G and H the planar Ramsey number PR(G,H) is the smallest integer n such that every planar graph F on n vertices either contains a copy of G or its complement contains a copy H . By studying the existence of subhamiltonian cycles in complements of sparse graphs, we determine all planar Ramsey numbers for pairs of cycles.
متن کاملCycles Are Strongly Ramsey-Unsaturated
We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H. This notion was introduced by Balister, Lehel and Schelp in [2], where it is shown that cycles (except for C4) are Ramsey-unsaturated, and conjectured that, moreover, one may add any chord without changing the Ramsey number of the cycle Cn, u...
متن کاملSequential Equilibria in a Ramsey Tax Model
The authors thank the co-editor, Nancy Stokey, and three anonymous referees for valuable comments. The views expressed herein are those of the authors and not necessarily those of the Federal Reserve Bank of Minneapolis or the Federal Reserve System.
متن کاملHypergraph Ramsey numbers: tight cycles versus cliques
For s ≥ 4, the 3-uniform tight cycle C s has vertex set corresponding to s distinct points on a circle and edge set given by the s cyclic intervals of three consecutive points. For fixed s ≥ 4 and s 6≡ 0 (mod 3) we prove that there are positive constants a and b with 2 < r(C s ,K 3 t ) < 2 bt log . The lower bound is obtained via a probabilistic construction. The upper bound for s > 5 is proved...
متن کاملBipartite anti-Ramsey numbers of cycles
We determine the maximum number of colors in a coloring of the edges of Km;n such that every cycle of length 2k contains at least two edges of the same color. One of our main tools is a result on generalized path covers in balanced bipartite graphs. For positive integers q a, let g(a;q) be the maximum number of edges in a spanning subgraph G of Ka;a such that the minimum number of vertex-disjoi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2007
ISSN: 1556-5068
DOI: 10.2139/ssrn.1083637